The authors discussed the procedure of building a sequential coded quardtree , explain how to add points clouds to nodes of tree 闡述了順序四叉樹(shù)的快速建立,并通過(guò)一個(gè)試驗(yàn)系統(tǒng)驗(yàn)證了文中所提方法的有效性。
In order to fast culling invisible data and make result of progressive rendering reasonable , a sequential coded quardtree is built with points clouds evenly distributed to nodes of every layer from top to down 該方法通過(guò)構(gòu)建一棵順序四叉樹(shù)使點(diǎn)云均勻分布在四叉樹(shù)節(jié)點(diǎn)上,來(lái)實(shí)現(xiàn)快速的數(shù)據(jù)篩選。